%------------------------------------------------------------------------------
% File     : Satallax---3.5
% Problem  : NUM666^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 13:54:54 EDT 2022

% Result   : Theorem 0.22s 0.39s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
thf(ty_nat,type,
    nat: $tType ).

thf(ty_moreis,type,
    moreis: nat > nat > $o ).

thf(ty_z,type,
    z: nat ).

thf(ty_y,type,
    y: nat ).

thf(ty_some,type,
    some: ( nat > $o ) > $o ).

thf(ty_lessis,type,
    lessis: nat > nat > $o ).

thf(ty_diffprop,type,
    diffprop: nat > nat > nat > $o ).

thf(ty_x,type,
    x: nat ).

thf(sP1,plain,
    ( sP1
  <=> ! [X1: nat,X2: nat] :
        ( ( moreis @ X1 @ X2 )
       => ( lessis @ X2 @ X1 ) ) ),
    introduced(definition,[new_symbols(definition,[sP1])]) ).

thf(sP2,plain,
    ( sP2
  <=> ( ( moreis @ y @ z )
     => ( lessis @ z @ y ) ) ),
    introduced(definition,[new_symbols(definition,[sP2])]) ).

thf(sP3,plain,
    ( sP3
  <=> ( ( lessis @ z @ y )
     => ( ( some @ ( diffprop @ x @ y ) )
       => ( some @ ( diffprop @ x @ z ) ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP3])]) ).

thf(sP4,plain,
    ( sP4
  <=> ( some @ ( diffprop @ x @ y ) ) ),
    introduced(definition,[new_symbols(definition,[sP4])]) ).

thf(sP5,plain,
    ( sP5
  <=> ( lessis @ z @ y ) ),
    introduced(definition,[new_symbols(definition,[sP5])]) ).

thf(sP6,plain,
    ( sP6
  <=> ( sP4
     => ( some @ ( diffprop @ x @ z ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP6])]) ).

thf(sP7,plain,
    ( sP7
  <=> ! [X1: nat] :
        ( sP5
       => ( ( some @ ( diffprop @ X1 @ y ) )
         => ( some @ ( diffprop @ X1 @ z ) ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP7])]) ).

thf(sP8,plain,
    ( sP8
  <=> ! [X1: nat,X2: nat,X3: nat] :
        ( ( lessis @ X1 @ X2 )
       => ( ( some @ ( diffprop @ X3 @ X2 ) )
         => ( some @ ( diffprop @ X3 @ X1 ) ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP8])]) ).

thf(sP9,plain,
    ( sP9
  <=> ( some @ ( diffprop @ x @ z ) ) ),
    introduced(definition,[new_symbols(definition,[sP9])]) ).

thf(sP10,plain,
    ( sP10
  <=> ! [X1: nat] :
        ( ( moreis @ y @ X1 )
       => ( lessis @ X1 @ y ) ) ),
    introduced(definition,[new_symbols(definition,[sP10])]) ).

thf(sP11,plain,
    ( sP11
  <=> ! [X1: nat,X2: nat] :
        ( ( lessis @ z @ X1 )
       => ( ( some @ ( diffprop @ X2 @ X1 ) )
         => ( some @ ( diffprop @ X2 @ z ) ) ) ) ),
    introduced(definition,[new_symbols(definition,[sP11])]) ).

thf(sP12,plain,
    ( sP12
  <=> ( moreis @ y @ z ) ),
    introduced(definition,[new_symbols(definition,[sP12])]) ).

thf(satz16d,conjecture,
    sP9 ).

thf(h0,negated_conjecture,
    ~ sP9,
    inference(assume_negation,[status(cth)],[satz16d]) ).

thf(1,plain,
    ( ~ sP8
    | sP11 ),
    inference(all_rule,[status(thm)],]) ).

thf(2,plain,
    ( ~ sP11
    | sP7 ),
    inference(all_rule,[status(thm)],]) ).

thf(3,plain,
    ( ~ sP7
    | sP3 ),
    inference(all_rule,[status(thm)],]) ).

thf(4,plain,
    ( ~ sP3
    | ~ sP5
    | sP6 ),
    inference(prop_rule,[status(thm)],]) ).

thf(5,plain,
    ( ~ sP6
    | ~ sP4
    | sP9 ),
    inference(prop_rule,[status(thm)],]) ).

thf(6,plain,
    ( ~ sP1
    | sP10 ),
    inference(all_rule,[status(thm)],]) ).

thf(7,plain,
    ( ~ sP10
    | sP2 ),
    inference(all_rule,[status(thm)],]) ).

thf(8,plain,
    ( ~ sP2
    | ~ sP12
    | sP5 ),
    inference(prop_rule,[status(thm)],]) ).

thf(m,axiom,
    sP4 ).

thf(n,axiom,
    sP12 ).

thf(satz16a,axiom,
    sP8 ).

thf(satz13,axiom,
    sP1 ).

thf(9,plain,
    $false,
    inference(prop_unsat,[status(thm),assumptions([h0])],[1,2,3,4,5,6,7,8,m,n,satz16a,satz13,h0]) ).

thf(0,theorem,
    sP9,
    inference(contra,[status(thm),contra(discharge,[h0])],[9,h0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem  : NUM666^1 : TPTP v8.1.0. Released v3.7.0.
% 0.03/0.14  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.15/0.36  % Computer : n015.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Thu Jul  7 03:38:04 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.22/0.39  % SZS status Theorem
% 0.22/0.39  % Mode: mode213
% 0.22/0.39  % Inferences: 7
% 0.22/0.39  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------